//
// Created by nicemoe on 2021/8/8.
//

#include  <bits/stdc++.h>

using namespace std;

int main()
{

    queue<int> q;

    q.push(1);
    q.push(2);
    cout << q.size() << endl;
    cout << q.front() << endl;
    q.pop();
    cout << q.empty() << endl;

    //默认优先先输出大的
    priority_queue<int> pq;
    //默认优先输出小的
//    priority_queue<int,vector<int>,greater<int> > pq;
    pq.push(1);
    pq.push(150);
    pq.push(100);
    while (!pq.empty())
    {
        cout << pq.top() << endl;
        pq.pop();
    }

    return 0;
}
